Faster algorithms for growing prioritized disks and rectangles
نویسندگان
چکیده
منابع مشابه
Faster Algorithms for Growing Prioritized Disks and Rectangles
Motivated by map labeling, we study the problem in which we are given a collection of n disks in the plane that grow at possibly different speeds. Whenever two disks meet, the one with the higher index disappears. This problem was introduced by Funke, Krumpe, and Storandt [IWOCA 2016]. We provide the first general subquadratic algorithm for computing the times and the order of disappearance. Ou...
متن کاملCuttings for Disks and Axis-Aligned Rectangles in Three-Space
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1r -cutting is a covering of the space with simplices such that the interior of each simplex intersects at most n/r objects. For n pairwise disjoint disks in R and a parameter r ∈ N, we construct a 1r -cutting of size O(r). For n axis-a...
متن کاملMajorization Algorithms for Inspecting Circles, Ellipses, Squares, Rectangles, and Rhombi
In several disciplines as diverse as shape analysis, location theory, quality control, archaeology, and psychometrics, it can be of interest to fit a circle through a set of points. We use the result that it suffices to locate a center for which the variance of the distances from the center to a set of given points is minimal. In this paper, we propose a new algorithm based on iterative majoriz...
متن کاملAlgorithms for Faster Disk Access
As processor clock rates continue to track Moore’s law, data access time is getting longer relative to CPU cycles. This is true whether the data comes from main memory, secondary storage, or external I/O. In many cases caching can alleviate congestion by keeping frequently used data in faster memory; but in order to use data from a disk it must be physically read at some point. Accordingly, it ...
متن کاملFaster Algorithms for Frobenius Numbers
The Frobenius problem, also known as the postage-stamp problem or the moneychanging problem, is an integer programming problem that seeks nonnegative integer solutions to x1a1 + · · · + xnan = M , where ai and M are positive integers. In particular, the Frobenius number f(A), where A = {ai}, is the largest M so that this equation fails to have a solution. A simple way to compute this number is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2019
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.02.001